Quantum Automata for some Multiperiodic Languages
نویسندگان
چکیده
We exhibit small size measure-once one-way quantum finite automata (mo-1qfa’s) inducing multiperiodic stochastic events. Moreover, for certain classes of multiperiodic languages, we exhibit: (i) isolated cut point mo-1qfa’s whose size logarithmically depends on the periods; (ii) Monte Carlo mo-1qfa’s whose size logarithmically depends on the periods and polynomially on the inverse of the error probability. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملNovel efficient fault-tolerant full-adder for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for semiconductor transistor based technologies. A novel fault-tolerant QCA full-adder cell is proposed: This component is simple in structure and suitable for designing fault-tolerant QCA circuits. The redundant version of QCA full-adder cell is powerful in terms of implementing robust digital functions. ...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملQuantum Finite Automata
Quantum finite automata (QFAs) are quantum counterparts of the usual finite automata. 1way QFAs recognize the same languages as conventional finite automata but can be exponentially more space-efficient. In this talk, we describe the main results about quantum finite automata and some possible areas for future work. In particular, we will discuss: • the languages for which QFAs can be smaller t...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006